Accelerating the Requirement Space Exploration through Coarse-Grained Parallel Execution

نویسندگان

  • Zhongwei Lin
  • Yiping Yao
چکیده

The design and analysis of complex systems need to determine suitable configurations for meeting requirement constraints. The Monotonic Indices Space (MIS) method is a useful approach for monotonic requirement space exploration. However, the method is highly time and memory-Consuming. Aiming to the problem of low efficiency of sequential MIS method, this paper introduces a coarse-grained parallel execution mechanism to the MIS method for accelerating the process of requirement space exploration. The task pool model is used to receive and deploy hyperboxes for work balancing. To validate our approach, the speedup is estimated by a mathematical analysis and then an experiment is conducted in a PC cluster environment. The results show that high speedup and efficiency is achieved through our approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Evaluation of a Coarse-Grained Reconfigurable Architecture

Coarse-grained reconfigurable architectures have become more attractive with the increasing requirement of more flexibility and higher performance in embedded systems design. In this paper, we suggest a design space exploration flow that enables effective optimization of reconfigurable architectures through SystemC Modeling. In the suggested flow, application-to-architecture mapping process tri...

متن کامل

Compiling for Coarse-Grained Reconfigurable Architectures based on dataflow execution paradigm

Coarse-Grained Reconfigurable Architectures(CGRAs) can be employed for accelerating computational workloads that demand both flexibility and performance. CGRAs comprise a set of computation elements interconnected using a network and this interconnection of computation elements is referred to as a reconfigurable fabric. The size of application that can be accommodated on the reconfigurable fabr...

متن کامل

Parallelization Strategies for Variable Neighborhood Search

We analyze five parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic. They are based on asynchronous cooperation of several search threads. We tested parallelization on various levels, from a low-level parallel neighborhood exploration, through medium-grained asynchronous execution of basic VNS steps (shaking and local search), to the coarse-grained asynchronous ...

متن کامل

Reliability Evaluation Environment for Exploring Design Space of Coarse-Grained Reconfigurable Architectures

This paper proposes a reliability evaluation environment for coarse-grained reconfigurable architectures. This environment is designed so that it can be easily extended to different target architectures and applications by automating the generation of the simulation inputs such as HDL codes for fault injection and configuration information. This automation enables us to explore a huge design sp...

متن کامل

Communication-Efficient Deterministic Parallel Algorithms for Planar Point Location and 2d Voronoi Diagram

In this paper we describe deterministic parallel algorithms for planar point location and for building the Voronoi Diagram of n co-planar points. These algorithms are designed for BSP-like models of computation, where p processors, with O(~) ~> O(1) local memory each, communicate through some arbitrary interconnection network. They axe communication-efficient since they require, respectively, O...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011